Single-server queues with spatially distributed arrivals
نویسندگان
چکیده
منابع مشابه
Single-server queues with spatially distributed arrivals
Consider a queueing system where customers arrive at a circle according to a homogeneous Poisson process. After choosing their positions on the circle, according to a uniform distribution, they wait for a single server who travels on the circle. The server’s movement is modelled by a Brownian motion with drift. Whenever the server encounters a customer, he stops and serves this customer. The se...
متن کاملLight-Traffic Analysis for Queues with Spatially Distributed Arrivals
We consider the following continuous polling system: Customers arrive according to a homogeneous Poisson process (or a more general stationary point process) and wait on a circle in order to be served by a single server. The server is “greedy”, in the sense that he always moves (with constant speed) towards the nearest customer. The customers are served according to an arbitrary service time di...
متن کاملInfinite-server Queues with Batch Arrivals and Dependent Service Times
Motivated by large-scale service systems, we consider an infinite-server queue with batch arrivals, where the service times are dependent within each batch. We allow the arrival rate of batches to be time-varying as well as constant. As regularity conditions, we require that the batch sizes be i.i.d. and independent of the arrival process of batches, and we require that the service times within...
متن کاملScheduling Arrivals to Queues: A Single-Server Model with No-Shows
Q systems with scheduled arrivals, i.e., appointment systems, are typical for frontal service systems, e.g., health clinics. An aspect of customer behavior that influences the overall efficiency of such systems is the phenomenon of no-shows. The consequences of no-shows cannot be underestimated; e.g., British surveys reveal that in the United Kingdom alone more than 12 million general practitio...
متن کاملstationary single-server queues
This paper complements two previous studies (Daley and Rolski, 1984, 199 1) by indicating the extent to which characteristics of a general stationary point process taken as the arrival process of a single-server queue influence light traffic limit theorems for the two essentially distinct schemes of dilation and thinning as routes to the limit. Properties of both the work-load and the waiting-t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 1994
ISSN: 0257-0130,1572-9443
DOI: 10.1007/bf01158698